Newton Two-stage Parallel Iterative Methods for Nonlinear Problems
نویسندگان
چکیده
Two-stage parallel Newton iterative methods to solve nonlinear systems of the form F (x) = 0 are introduced. These algorithms are based on the multisplitting technique and on the two-stage iterative methods. Convergence properties of these methods are studied when the Jacobian matrix F ′(x) is either monotone or an H-matrix. Furthermore, in order to illustrate the performance of the algorithms studied, computational results about these methods on a distributed memory multiprocessor are discussed. The platform used is an IBM RS/6000 SP with 12 nodes. The parallel environment has been managed using the MPI library of parallel routines.
منابع مشابه
Aerodynamic Applications of Newton-krylov-schwarz Solvers
Parallel implicit solution methods are increasingly important in aerodynamics , since reliable low-residual solutions at elevated CFL number are prerequisite to such large-scale applications of aerodynamic analysis codes as aeroelasticity and optimization. In this chapter, a class of nonlinear implicit methods and a class of linear implicit methods are deened and illustrated. Their composition ...
متن کاملNewton-krylov-schwarz Methods in Cfd 1
Newton-Krylov methods are potentially well suited for the implicit solution of nonlinear problems whenever it is unreasonable to compute or store a true Jacobian. Krylov-Schwarz iterative methods are well suited for the parallel implicit solution of multidimensional systems of boundary value problems that arise in CFD. They provide good data locality so that even a high-latency workstation netw...
متن کاملNewton-krylov-schwarz Methods in Cfd
Newton-Krylov methods are potentially well suited for the implicit solution of nonlinear problems whenever it is unreasonable to compute or store a true Jacobian. Krylov-Schwarz iterative methods are well suited for the parallel implicit solution of multidimensional systems of boundary value problems that arise in CFD. They provide good data locality so that even a high-latency workstation netw...
متن کاملParallel Full Space SQP Lagrange-Newton-Krylov-Schwarz Algorithms for PDE-Constrained Optimization Problems
Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for the parallel numerical solution of such problems involve sequential quadratic programming (SQP), with either reduced or full space approaches. In this paper we propose and investigate a class of parallel full space SQP Lagrange...
متن کاملInexact Newton Methods and Mixed Nonlinear Complementary Problems
In this paper we present the results obtained in the solution of sparse and large systems of nonlinear equations by Inexact Newton-like methods [6]. The linearized systems are solved with two preconditioners particularly suited for parallel computation. We report the results for the solution of some nonlinear problems on the CRAY T3E under the MPI environment. Our methods may be used to solve m...
متن کامل